package q1037_isBoomerang;

public class Solution {
    /*
    直接比较斜率 然后转为乘积
     */
    public boolean isBoomerang(int[][] points) {
        return (points[2][0] - points[0][0]) * (points[1][1] - points[0][1]) != (points[1][0] - points[0][0]) * (points[2][1] - points[0][1]);
    }
}
